An approach to rank efficient DMUs in DEA based on combining Manhattan and infinity norms

In many applications, discrimination among decision making units (DMUs) is a problematic technical task procedure to decision makers in data envelopment analysis (DEA). The DEA models unable to discriminate between extremely efficient DMUs. Hence, there is a growing interest in improving discrimination power in DEA yet. The aim of this paper is ranking extreme efficient DMUs in DEA based on exploiting the leave-one out idea and combining of Manhattan and infinity norms with constant and variable returns to scale. The proposed method has been able to overcome the existing difficulties in some ranking methods.